The Optimal Approximations for Solving Linear Ill-Posed Problems
نویسندگان
چکیده
منابع مشابه
Ill-Posed and Linear Inverse Problems
In this paper ill-posed linear inverse problems that arises in many applications is considered. The instability of special kind of these problems and it's relation to the kernel, is described. For finding a stable solution to these problems we need some kind of regularization that is presented. The results have been applied for a singular equation.
متن کاملDynamical systems method for solving linear ill-posed problems
Various versions of the Dynamical Systems Method (DSM) are proposed for solving linear ill-posed problems with bounded and unbounded operators. Convergence of the proposed methods is proved. Some new results concerning discrepancy principle for choosing regularization parameter are obtained.
متن کاملA new method for solving linear ill-posed problems
In this paper, we propose a new method for solving large-scale ill-posed problems. This method is based on the Karush–Kuhn–Tucker conditions, Fisher–Burmeister function and the discrepancy principle. The main difference from the majority of existing methods for solving ill-posed problems is that, we do not need to choose a regularization parameter in advance. Experimental results show that the ...
متن کاملA double optimal descent algorithm for iteratively solving ill-posed linear inverse problems
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملDouble Optimal Regularization Algorithms for Solving Ill-Posed Linear Problems under Large Noise
A double optimal solution of an n-dimensional system of linear equations Ax = b has been derived in an affine m-dimensional Krylov subspace with m n. We further develop a double optimal iterative algorithm (DOIA), with the descent direction z being solved from the residual equation Az = r0 by using its double optimal solution, to solve ill-posed linear problem under large noise. The DOIA is pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2001
ISSN: 0885-064X
DOI: 10.1006/jcom.2000.0546